Using Symbolic Computation to Prove Nonexistence of Distance-Regular Graphs
نویسندگان
چکیده
منابع مشابه
Using symbolic computation to prove nonexistence of distance-regular graphs
A package for the Sage computer algebra system is developed for checking feasibility of a given intersection array for a distance-regular graph. We use this tool to show that there is no distance-regular graph with intersection array {(2r + 1)(4r + 1)(4t− 1), 8r(4rt− r + 2t), (r + t)(4r + 1); 1, (r + t)(4r + 1), 4r(2r + 1)(4t− 1)} (r, t ≥ 1), {135,128,16; 1,16,120}, {234,165,12; 1,30,198} or {5...
متن کاملUsing equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
We prove the nonexistence of a distance-regular graph with intersection array {74,54,15;1,9,60} and of distance-regular graphs with intersection arrays { 4r3 + 8r2 + 6r + 1,2r(r + 1)(2r + 1),2r2 + 2r + 1;1,2r(r + 1), (2r + 1)(2r2 + 2r + 1)} with r an integer and r 1. Both cases serve to illustrate a technique which can help in determining structural properties for distance-regular graphs and as...
متن کاملNonexistence of a Class of Distance-Regular Graphs
Let Γ denote a distance-regular graph with diameter D > 3 and intersection numbers a1 = 0, a2 6= 0, and c2 = 1. We show a connection between the d-bounded property and the nonexistence of parallelograms of any length up to d+ 1. Assume further that Γ is with classical parameters (D, b, α, β), Pan and Weng (2009) showed that (b, α, β) = (−2,−2, ((−2)D+1−1)/3). Under the assumption D > 4, we excl...
متن کاملNonexistence of Some 4-regular Integral Graphs
A graph is called integral if all its eigenvalues are integers. The quest for integral graphs was initiated by F. Harary and A. J. Schwenk [9]. All such cubic graphs were obtained by D. Cvetković and F. C. Bussemaker [2, 1], and independently by A. J. Schwenk [10]. There are exactly thirteen cubic integral graphs. In fact, D. Cvetković [2] proved that the set of regular integral graphs of a fix...
متن کاملEdge-distance-regular graphs are distance-regular
A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that every edge-distance-regular graph Γ is distance-regular and homogeneous. More precisely, Γ is edge-distance-regular if and only if it is bipartite distance-reg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2018
ISSN: 1077-8926
DOI: 10.37236/7763